On a system of axioms which has no recursively enumerable arithmetic model
نویسندگان
چکیده
منابع مشابه
On Recursively Enumerable Structures
We state some general facts on r.e. structures, e.g. we show that the free countable structures in quasivarieties are r.e. and construct acceptable numerations and universal r.e. structures in quasivarieties. The last facts are similar to the existence of acceptable numerations of r.e. sets and creative sets. We state a universality property of the acceptable numerations, classify some index se...
متن کاملThe Recursively Enumerable Degrees
Decision problems were the motivating force in the search for a formal definition of algorithm that constituted the beginnings of recursion (computability) theory. In the abstract, given a set A the decision problem for A consist of finding an algorithm which, given input n, decides whether or not n is in A. The classic decision problem for logic is whether a particular sentence is a theorem of...
متن کاملRecursive and Recursively Enumerable
I. Basic concepts 1. Recursive enumerability and recursiveness. We consider infinite sequences of non-negative integers, free from repetitions. A familiar equivalence relation between such sequences is that based on sets: two sequences are equivalent when they enumerate the same set. The equivalence classes under this relation, with the necessary operations introduced, form a system isomorphic ...
متن کاملOn the Lattice of Recursively Enumerable Sets
This paper presents some new theorems concerning recursively enumerable (r.e.) sets. The aim of the paper is to advance the search for a decision procedure for the elementary theory of r.e. sets. More precisely, an effective method is sought for deciding whether or not an arbitrary sentence formulated in the lower predicate calculus with sole relative symbol £ is true of the r.e. sets. The main...
متن کاملRelatively recursively enumerable reals
We say that a real X is relatively r.e. if there exists a real Y such that X is r.e. (Y ) and X 6≤T Y . We say X is relatively REA if there exists such a Y ≤T X. We define A ≤e1 B if there exists a Σ1 set C such that n ∈ A if and only if there is a finite E ⊆ B with (n, E) ∈ C. In this paper we show that a real X is relatively r.e. if and only if X 6≤e1 X. We prove that every nonempty Π01 class...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 1953
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm-40-1-56-61